Time-delay Embeddings of Ifs Attractors

نویسندگان

  • SONYA BAHAR
  • S. Bahar
چکیده

A modified type of iterated function system (IFS) has recently been shown to generate images qualitatively similar to “classical” chaotic attractors. Here, we use time-delay embedding reconstructions of time-series from this system to generate three-dimentional projections of IFS attractors. These reconstructions may be used to access the topological structure of the periodic orbits embedded within the attractor. This topological characterization suggests an approach by which a rigorous comparison of IFS attractors and classical chaotic systems may be attained. A modified iterated function system (IFS) has recently been shown to generate images resembling the classical chaotic attractors generated by nonlinear dynamical systems. These “IFS attractors” exhibit dynamical structure and are classifiable by symbolic dynamics.1 In the present paper, we illustrate how their three-dimensional structures may be accessed by a time-delay embedding reconstruction. A typical IFS consists of N affine transformations of the form xn+1 = aixn + biyn + ci yn+1 = dixn + eiyn + fi (1) where i = 1, . . . ,N , and ai, bi, ci, di, ei and fi are constants, and each transformation is assigned a probability pi. A fractal image is generated from an IFS by iterating the mapping according to the scheme described by Barnsley2 in which each new point is generated from the previous point by the application of one of the N transformations. The particular transformation to be employed in each transformation is selected at random, with probability pi. An IFS attractor is generated by a similar algorithm, except that in place of the affine transformations in (1), we have ∗E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h . D S / 07 03 39 8 v 1 1 4 M ar 2 00 7 TRANSFORMATIONS BETWEEN ATTRACTORS OF HYPERBOLIC ITERATED FUNCTION SYSTEMS

This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant subspace of code space, whence the entropy of the IFS, and of its set-attractor, may be defined. Given any ordered pair of hyperbolic IFSs, each with the same...

متن کامل

The Geometry of Baire Spaces

We introduce the concept of Baire embeddings and we classify them up to C conjugacies. We show that two such embeddings are Cequivalent if and only if they have exponentially equivalent geometries. Next, we introduce the class of IFS-like Baire embeddings and we also show that two Hölder equivalent IFS-like Baire embeddings are C conjugate if and only if their scaling functions are the same. In...

متن کامل

Real Projective Iterated Function Systems

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...

متن کامل

Real Projective Iterated Function Systems

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem establishes that a projective IFS has at most one attractor. In the third theorem the classical duality between points and hyperplanes in projective space leads to c...

متن کامل

On the Use of Shift Dynamics in Synthesizing Fractal Images

The contribution of this paper is a new version of the escape time algorithm adapted to synthesize fractal images, identified with attractors of iterated function systems (IFS). The proposed synthesis algorithm is based on the use of shift dynamics, associated with one or another IFS. The novelty of the algorithm is grounded on two factors. Firstly, the strategy for the separation of extended d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999